A GPI dynasearch neighborhood for the total weighted tardiness problem

art exact algorithms suffer from relatively poor performances. On the other hand the problem has been successfully tackled by local search heuristic algorithms where the neighborhood of a solution is usually computed by applying swap (a.k.a. pairwise interchange) operators to the working sequence. Dynasearch is a neighborhood search technique introduced by Congram et al. [1] whose main feature is the ability of searching exponential size neighborhoods in polynomial time by exploiting problem structure. To the authors’ knowledge, the implementation of the so-called iterated